TVNews
OpenLibrary
|
|
|
|
| Anonymous User (login or join us) |
![[help]](/images/question.gif "[help]")
)
(143.2 M)MPEG4
(144.1 M)MPEG4
(145.7 M)MPEG4
(147.5 M)MPEG4
(155.4 M)MPEG4
(155.9 M)MPEG4
(157.2 M)MPEG4
(159.8 M)MPEG4
(160.6 M)MPEG4
(161.3 M)MPEG4
(163.9 M)MPEG4
(166.5 M)MPEG4
(166.9 M)MPEG4
(166.9 M)MPEG4
(167.7 M)MPEG4
(169.7 M)MPEG4
(172.6 M)MPEG4
(174.5 M)MPEG4
(174.7 M)MPEG4
(175.2 M)MPEG4
(177.6 M)MPEG4
(178.9 M)MPEG4
(179.2 M)MPEG4
(285.2 M)Ogg Video
(288.3 M)Ogg Video
(292.8 M)Ogg Video
(294.2 M)Ogg Video
(309.1 M)Ogg Video
(309.5 M)Ogg Video
(312.9 M)Ogg Video
(314.0 M)Ogg Video
(319.9 M)Ogg Video
(321.6 M)Ogg Video
(323.7 M)Ogg Video
(328.0 M)Ogg Video
(329.6 M)Ogg Video
(336.3 M)Ogg Video
(336.7 M)Ogg Video
(338.4 M)Ogg Video
(348.3 M)Ogg Video
(349.7 M)Ogg Video
(350.6 M)Ogg Video
(353.8 M)Ogg Video
(354.0 M)Ogg Video
(356.9 M)Ogg Video
(357.1 M)Ogg Video
![[Attribution-Noncommercial-Share Alike 3.0]](https://i.creativecommons.org/l/by-nc-sa/3.0/88x31.png "[Attribution-Noncommercial-Share Alike 3.0]")
This movie is part of the collection: MIT OpenCourseWare
Producer: MIT OpenCourseWare
Audio/Visual: sound, color
Language: English
Keywords: algorithms, efficient algorithms, sorting, search trees, heaps, hashing, divide-and-conquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, parallel computing
Creative Commons license: Attribution-Noncommercial-Share Alike 3.0
| Movie Files | MPEG4 | Ogg Video |
| Lecture 14: Competitive Analysis: Self-organizing Lists |
155.4 MB
|
309.5 MB
|
| Lecture 07: Hashing, Hash Functions |
163.9 MB
|
319.9 MB
|
| Lecture 22: Advanced Topics |
157.2 MB
|
312.9 MB
|
| Lecture 08: Universal Hashing, Perfect Hashing |
166.9 MB
|
328.0 MB
|
| Lecture 23: Advanced Topics (cont.) |
161.3 MB
|
309.1 MB
|
| Lecture 15: Dynamic Programming, Longest Common Subsequence |
147.5 MB
|
292.8 MB
|
| Lecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort |
166.9 MB
|
336.7 MB
|
| Lecture 16: Greedy Algorithms, Minimum Spanning Trees |
172.6 MB
|
349.7 MB
|
| Lecture 24: Advanced Topics (cont.) |
177.6 MB
|
353.8 MB
|
| Lecture 02: Asymptotic Notation/Recurrences/Substitution, Master Method |
145.7 MB
|
294.2 MB
|
| Lecture 25: Advanced Topics (cont.)/Discussion of Follow-on Classes |
178.9 MB
|
356.9 MB
|
| Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search |
174.5 MB
|
354.0 MB
|
| Lecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication |
143.2 MB
|
285.2 MB
|
| Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints |
159.8 MB
|
323.7 MB
|
| Lecture 09: Relation of BSTs to Quicksort/Analysis of Random BST |
169.7 MB
|
338.4 MB
|
| Lecture 10: Red-black Trees, Rotations, Insertions, Deletions |
174.7 MB
|
350.6 MB
|
| Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson |
155.9 MB
|
314.0 MB
|
| Lecture 04: Quicksort, Randomized Algorithms |
167.7 MB
|
336.3 MB
|
| Lecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees |
175.2 MB
|
348.3 MB
|
| Lecture 12: Skip Lists |
179.2 MB
|
357.1 MB
|
| Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort |
160.6 MB
|
321.6 MB
|
| Lecture 06: Order Statistics, Median |
144.1 MB
|
288.3 MB
|
| Lecture 13: Amortized Algorithms, Table Doubling, Potential Method |
166.5 MB
|
329.6 MB
|
| Image Files | Thumbnail | Animated GIF |
| Lecture 14: Competitive Analysis: Self-organizing Lists |
3.9 KB
|
440.0 KB
|
| Lecture 07: Hashing, Hash Functions |
5.7 KB
|
433.8 KB
|
| Lecture 22: Advanced Topics |
5.7 KB
|
436.5 KB
|
| Lecture 08: Universal Hashing, Perfect Hashing |
5.6 KB
|
443.9 KB
|
| Lecture 23: Advanced Topics (cont.) |
5.1 KB
|
417.3 KB
|
| Lecture 15: Dynamic Programming, Longest Common Subsequence |
5.4 KB
|
448.5 KB
|
| Lecture 01: Administrivia/Introduction/Analysis of Algorithms, Insertion Sort, Mergesort |
4.1 KB
|
423.8 KB
|
| Lecture 16: Greedy Algorithms, Minimum Spanning Trees |
5.7 KB
|
446.6 KB
|
| Lecture 24: Advanced Topics (cont.) |
4.9 KB
|
439.8 KB
|
| Lecture 02: Asymptotic Notation/Recurrences/Substitution, Master Method |
5.9 KB
|
439.8 KB
|
| Lecture 25: Advanced Topics (cont.)/Discussion of Follow-on Classes |
4.8 KB
|
446.3 KB
|
| Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search |
5.5 KB
|
447.0 KB
|
| Lecture 03: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication |
5.0 KB
|
430.4 KB
|
| Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints |
4.9 KB
|
445.4 KB
|
| Lecture 09: Relation of BSTs to Quicksort/Analysis of Random BST |
5.4 KB
|
451.3 KB
|
| Lecture 10: Red-black Trees, Rotations, Insertions, Deletions |
5.4 KB
|
465.5 KB
|
| Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson |
7.0 KB
|
445.0 KB
|
| Lecture 04: Quicksort, Randomized Algorithms |
4.5 KB
|
439.5 KB
|
| Lecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees |
5.7 KB
|
430.4 KB
|
| Lecture 12: Skip Lists |
5.8 KB
|
454.9 KB
|
| Lecture 05: Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort |
6.3 KB
|
458.8 KB
|
| Lecture 06: Order Statistics, Median |
4.8 KB
|
441.4 KB
|
| Lecture 13: Amortized Algorithms, Table Doubling, Potential Method |
5.6 KB
|
446.4 KB
|
| Information | Format | Size |
| MIT6.046JF05MPEG4_files.xml | Metadata | [file] |
| MIT6.046JF05MPEG4_meta.xml | Metadata | 1,023.0 B |
| MIT6.046JF05MPEG4_reviews.xml | Metadata | 181.0 B |
![[item image]](https://ia600300.us.archive.org/8/items/MIT6.046JF05MPEG4/ocw-6.046-02nov2005-220k.gif?cnt=0 "[item image]")
